/**
 * 
 */
package truerefactor.refactor;

import java.util.List;

import truerefactor.graph.ClassNode;
import truerefactor.graph.CodeGraph;
import truerefactor.graph.CodeNode;

/**
 * An Implementation of the Substitute Algorithm Refactoring Technique
 * 
 * @author Isaac
 */
public class SubstituteAlgorithm extends Refactoring {

    /**
     * 
     */
    public SubstituteAlgorithm()
    {
        this.name = "Substitute Algorithm";
        this.description = "";
    }

    /*
     * (non-Javadoc)
     * @see
     * truerefactor.refactor.Refactoring#execute(truerefactor.graph.CodeNode
     * [])
     */
    @Override
    public void execute(CodeGraph graph)
    {
        // 1. Prepare your alternative algorithm. Get it so it compiles

        // 2. Run the new algorithm against your tests, if the results are the
        // same you're finished.

        // 3. If the results aren't the same, use the old algorithm for
        // comparison in testing and debugging

    }
}
